A matrix minimization problem involving ranks
نویسندگان
چکیده
منابع مشابه
Displacement Ranks of a Matrix
The solution of many problems in physics and engineering reduces ultimately to the solution of linear equations of the form Ra = m, where JR and m are given N x N and N x 1 matrices and a is to be determined. Here our concern is with the fact that it generally takes 0(N) computations (one computation being the multiplication of two real numbers) to do this, and this might be a substantial burde...
متن کاملA Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem
The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous permutation of the rows and the columns of a square matrix in order to keep its nonzero entries close to the main diagonal. The MBMP is a highly investi...
متن کاملA Genetic Programming Approach to the Matrix Bandwidth-Minimization Problem
The bandwidth of a sparse matrix is the distance from the main diagonal beyond which all elements of the matrix are zero. The bandwidth minimisation problem for a matrix consists of finding the permutation of rows and columns of the matrix which ensures that the non-zero elements are located in as narrow a band as possible along the main diagonal. This problem, which is known to be NP-complete,...
متن کاملOn a Zero-Finding Problem Involving the Matrix Exponential
An important step in the solution of a matrix nearness problem that arises in certain machine learning 3 applications is finding the zero of f(α) = z exp(logX + αzz )z − b. The matrix valued exponential and logarithm 4 in f(α) arises from the use of the von Neumann matrix divergence tr(X logX − X log Y − X + Y ) to measure the 5 nearness between the positive definite matrices X and Y . A key st...
متن کاملOn the complexity of Boolean matrix ranks
We construct a reduction which proves that the fooling set number and the determinantal rank of a Boolean matrix are NP-hard to compute. This note is devoted to the functions of determinantal rank and fooling set number, which are receiving attention in different applications, see [1, 3] and references therein. The purpose of this note is to give an NP-completeness proof for those functions, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90252-7